Problem session

Problems for Problem Session

is its closed normal subgroup, [Sh], [Ka]. The group Aut∗k k [n] is an infinite dimensional simple algebraic group, [Sh]. If D is a locally nilpotent k-derivation of k, then it is easily seen that exp tD ∈ Aut∗k k [n] for any t ∈ k, so D lies in Lie(Aut∗k k ). It follows from [BB1], [BB2] that n − 1 is the maximum of dimensions of algebraic tori contained in Aut∗k k , and that every algebraic t...

Open problem session

Let P be a simple piecewise-geodesic curve on a sphere, i.e., a curve composed of a finite sequence of arcs of great circles that do not intersect except at shared endpoints. A development of P is a polygonal chain in the plane whose segments have the same lengths as the arcs of P, and whose angles correspond to the angles between the arcs on the sphere. A development can be viewed as created b...

Session S1H Problem-based learning of theoretical computer science

In this paper, we report our first experiment in teaching the theory of computability in the problem-based way. As far as we know, this is the first experiment of applying the problem-based method to a purely theoretical course of computer science. Performing the course consisted of three parts: First, the new subjects were learnt according to the classical seven step method, which contains bot...

Session A: Using the possibilities of ICT measuring problem solving

The Impact of Timing Knowledge on the Session Problem

The session problem is an abstraction of fundamental synchronization problems in distributed systems. It has previously been used as a test case to demonstrate the differences in the time needed to solve problems in several timing models. The goal of this paper is to compare the computational power of a family of partially synchronous models by studying the time needed to solve the session prob...